WARX: efficient white-box block cipher based on ARX primitives and random MDS matrix

نویسندگان

چکیده

White-box cryptography aims to provide secure cryptographic primitives and implementations for the white-box attack model, which assumes that an adversary has full access implementation of algorithms. Real-world applications require highly efficient schemes, whereas existing proposals cannot meet this demand. In paper, we design a new block cipher based on addition/rotation/XOR (ARX) random maximal distance separable (MDS) matrix, ARX (WARX), aiming in both black- models. The WARX black-box model is nine times faster than SPNbox-16 from ASI-ACRYPT’16, more WEM CT-RSA’17. Moreover, security models analyzed, ensures its practical applicability. shows linear layer can improve efficiency cipher. This article may inspire provably ciphers help narrow gap between schemes academia applicable great demand industry.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient and Provable White-Box Primitives

In recent years there have been several attempts to build white-box block ciphers whose implementations aim to be incompressible. This includes the weak white-box ASASA construction by Bouillaguet, Biryukov and Khovratovich from Asiacrypt 2014, and the recent space-hard construction by Bogdanov and Isobe from CCS 2015. In this article we propose the first constructions aiming at the same goal w...

متن کامل

Perfect Diffusion Primitives for Block Ciphers -- Building Efficient MDS Matrices

Although linear perfect diffusion primitives, i.e. MDS matrices, are widely used in block ciphers, e.g. AES, very little systematic work has been done on how to find “efficient” ones. In this paper we attempt to do so by considering software implementations on various platforms. These considerations lead to interesting combinatorial problems: how to maximize the number of occurrences of 1 in th...

متن کامل

MILP-Aided Bit-Based Division Property for ARX-Based Block Cipher

The huge time and memory complexities of utilizing bitbased division property, which was first presented by Todo and Morri at FSE 2016, bothered cryptographers for quite some time and it had been solved by Xiang et al. at ASIACRYPT 2016. They applied MILP method to search integral distinguisher based on division property, and used it to analyze six lightweight block ciphers. Later on, Sun et al...

متن کامل

An Efficient Quasigroup Block Cipher

Low powered devices, such as smart phones, tablets and sensors, present a particular challenge for advanced encryption systems. In this paper, we present a new quasigroup block encryption system that has low memory and computational requirements and hence suitable for low powered devices.We compare its performance against Advanced Encryption Standard-256 (AES-256) bit algorithm using theNIST st...

متن کامل

Lifting Based S-Box for Scalable Block Cipher Design Based on Filter Banks

The security of data exchange is considered a significant problem. It requires the use of various cryptographic algorithms, such as stream cipher and block cipher. The implementation of a secure cryptographic block cipher algorithm requires the generation of strong substitution and permutation layers. These layers should satisfy the principles of security (diffusion and confusion). The proposed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science China Information Sciences

سال: 2021

ISSN: ['1869-1919', '1674-733X']

DOI: https://doi.org/10.1007/s11432-020-3105-1